An extremal problem concerning graphs not containing K and K,−
نویسندگان
چکیده
منابع مشابه
On extremal k-supereulerian graphs
A graph G is called k-supereulerian if it has a spanning even subgraph with at most k components. In this paper, we prove that any 2-edge-connected loopless graph of order n is ⌈(n − 2)/3⌉-supereulerian, with only one exception. This result solves a conjecture in [Z. Niu, L. Xiong, Even factor of a graphwith a bounded number of components, Australas. J. Combin. 48 (2010) 269–279]. As applicatio...
متن کاملOn extremal k-outconnected graphs
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n ≥ 3k− 2 then m ≤ k(n− k), and for n ≥ 3k− 1 an equality is possible if, and only if, G is the complete bipartite graph Kk,n−k. Cai proved that if n ≤ 3k − 2 then m ≤ b(n + k)2/8c, and listed the cases when this bound is tight. In this paper we prove a more general theorem, which implies similar results for m...
متن کاملRamsey Numbers of K M versus (n; K)-graphs and the Local Density of Graphs Not Containing a K M
In this paper generalized Ramsey numbers of complete graphs K m versus the set h; n; ki of (n; k)-graphs are investigated. The value of r(K m ; hn; ki) is given in general for (relative to n) values of k small compared to n using a correlation with Turr an numbers. These generalized Ramsey numbers can be used to determine the local densities of graphs not containing a subgraph K m .
متن کاملExtremal K(s, t)-free bipartite graphs
Throughout this paper only undirected simple graphs (without loops or multiple edges) are considered. Unless stated otherwise, we follow the book by Bollobás [2] for undefined terminology and definitions. LetG = G(m,n) = G(X,Y ) denote a bipartite graph with vertex classesX and Y such that |X| = m and |Y | = n. A complete bipartite subgraph with s vertices in the class X and t vertices in the c...
متن کاملk-Remainder Cordial Graphs
In this paper we generalize the remainder cordial labeling, called $k$-remainder cordial labeling and investigate the $4$-remainder cordial labeling behavior of certain graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00091-1